O(√logn)Approximation Algorithms for Min UnCut, Min2CNF Deletion, and Directed Cut Problems – Papersᵞ

Warning: MathJax requires JavaScript to process the mathematics on this page.
If your browser supports JavaScript, be sure it is enabled.

☆

1

O(√logn)Approximation Algorithms for Min UnCut, Min2CNF Deletion, and Directed Cut Problems

https://dl.acm.org/doi/pdf/10.1145/1060590.1060675

Authors: Amit Agarwal, Moses Charikar, Konstantin Makarychev, Yury Makarychev
Liked by: Maximimi
Domains: Graph algorithmics
Tags: STOC05

Uploaded by: Maximimi
Upload date: 2020-06-11 20:24:11

Comments: